Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
311	c 2005 Society for Industrial and Applied Mathematics SIAM J. COMPUT. Vol. 34, No. 6, pp. 1331–1351 Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2009-09-24 16:08:59 Analysis of algorithms NP-complete problems Set cover problem Randomized algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
312	ts, Information and Uncertainty as Chichilnisky -idge University Press, 1999 CHAPTER 7 Add to Reading List Source URL: chichilnisky.com Language: English - Date: 2013-05-16 17:50:16 Academia Financial economics Incomplete markets General equilibrium theory Gérard Debreu Complete market David Cass Arrow–Debreu model Risk Economics Mathematical finance Fellows of the Econometric Society
313	GMMCP Tracker: Globally Optimal Generalized Maximum Multi Clique Problem for Multiple Object Tracking Afshin Dehghan Shayan Modiri Assari Mubarak Shah Center for Research in Computer Vision, University of Central Florida Add to Reading List Source URL: crcv.ucf.edu Language: English - Date: 2015-04-13 12:15:56 Clique problem Clique Graph operations Networks Tree decomposition Decomposition method Graph theory Theoretical computer science NP-complete problems
314	Midland Graduate School in Foundations of Computer Science Quantum Topos Theory Steve Vickers, School of Computer Science, University of Birmingham 2010 Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2010-03-30 03:56:09 Structure Support Ideal Complete partial order Partially ordered set Continuous function Sierpiński space Spectral theory of ordinary differential equations Lambda calculus Mathematics Order theory Mathematical analysis
315	A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4\|E(G)\| − \|V (G Add to Reading List Source URL: www.pkoms.com Language: English - Date: 2011-12-29 23:15:14 Matroid theory Polynomials Tutte polynomial Degree Tree NP-complete problems Path decomposition Handshaking lemma Graph theory Mathematics Theoretical computer science
316	Improved Bound for the Union of Fat Triangles∗ Esther Ezra† Boris Aronov‡ Abstract Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2010-10-14 21:45:02 Analysis of algorithms Computational geometry NP-complete problems Ε-net Time complexity Set cover problem Theoretical computer science Applied mathematics Computational complexity theory
317	In defence of Dedekind and Heine–Borel Paul Taylor Third Workshop on Formal Topology Padova, mercoled`ı, il 9 Maggio 2007 Add to Reading List Source URL: www.paultaylor.eu Language: English - Date: 2009-02-12 12:35:14 Metric geometry Real analysis Least-upper-bound property Order theory Cauchy sequence Real number Mathematical logic Complete metric space Compact space Mathematics Mathematical analysis Topology
318	Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar Add to Reading List Source URL: www.statistics.du.se Language: English - Date: 2014-04-22 07:57:30 NP-complete problems Travelling salesman problem Induced path Shortest path problem Graph Routing Combinatorial optimization Path Hamiltonian path Graph theory Theoretical computer science Mathematics
319	Complete calculation of electroweak corrections to the Drell–Yan process for LHC Vladimir ZYKUNOV, GSTU, Belarus Outline • Introduction Add to Reading List Source URL: gomelschool.hep.by Language: English - Date: 2007-08-02 03:49:00 Symbol Orbifold Electroweak theory Particle physics Electroweak interaction
320	First-order reasoning in Yices2 Master Thesis in Computer Science Simon Cruanes∗ supervised by Bruno Dutertre †, Viktor Kuncak ‡, Benjamin Werner § SRI International, Menlo Park, CA September 2011 – March 2012 Add to Reading List Source URL: cedeela.fr Language: English - Date: 2013-02-07 03:54:46 Automated theorem proving Model theory Logic in computer science Constraint programming NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories DPLL algorithm Interpretation Theoretical computer science Logic Mathematical logic

UPDATE